#include "BinarySearchTree.h"
#include <ctime>
#include <vector>
#include <algorithm>
#include <random>
using namespace std;
Template<typename T>
const N=100;
void BST_sort(std::vector<T> &_data)
{
	BinarySearchTree<T> Tree1;
	for(auto t=_data.begin();t!=_data.end();t++)
	   Tree1.insert(*t);
}
void Randomized_BST_sort(std::vector<T> &_data);
{
	int k=0;
    BinarySearchTree<T> Tree2;
    Tree2=_data;
    shuffle(Tree2.begin(),Tree2.end(),default_random_engine(N));
}
int main(int args,char* argv[])
{
	scrand(N);
    vector<int>_data(N);
	for(i=0;i<N;i++)
	   _data(i)=rand();
	clock_t start=clock();
	BST_sort(_data);
	clock_t end1=clock();
	Randomized_BST_sort(Tree1);
	clock_t end2=clock();
	cout<<end1-start<<endl;
	cout<<end2-start<<end2;
}
